The acyclic disconnection of a digraph

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The acyclic disconnection of a digraph

In this paper we introduce a numerical invariant of digraphs which generalizes that of the number of connected components of a graph. The ao,clic disconnection ~(D) of a digraph D is the minimum number of (weakly) connected components of the subdigraphs obtained from D by deleting an acyclic set of arcs. We state some results about this invariant and compute its value for a variety of circulant...

متن کامل

The Discrete Acyclic Digraph Markov Model in Data Mining

The research reported in this thesis has been partially carried out at CWI, the Dutch national research laboratory for mathematics and computer science, within the theme Data Mining and Knowledge Discovery, a subdivision of the research cluster Information Systems. To the memory of my mother A la memòria de ma mare

متن کامل

The Italian domatic number of a digraph

An {em Italian dominating function} on a digraph $D$ with vertex set $V(D)$ is defined as a function$fcolon V(D)to {0, 1, 2}$ such that every vertex $vin V(D)$ with $f(v)=0$ has at least two in-neighborsassigned 1 under $f$ or one in-neighbor $w$ with $f(w)=2$. A set ${f_1,f_2,ldots,f_d}$ of distinctItalian dominating functions on $D$ with the property that $sum_{i=1}^d f_i(v)le 2$ for each $vi...

متن کامل

Enumerating Markov Equivalence Classes of Acyclic Digraph Models

Graphical Markov models determined by acyclic digraphs (ADGs), also called directed acyclic graphs (DAOs), are widely studied in statistics, computer science (as Bayesian networks), operations research (as influence diagrams), and many related fields. Because different ADOs may determine the same Markov equivalence class, it long has been of interest to determine the efficiency gained in model ...

متن کامل

A note on the Roman domatic number of a digraph

Roman dominating function} on a digraph $D$ with vertex set $V(D)$ is a labeling$fcolon V(D)to {0, 1, 2}$such that every vertex with label $0$ has an in-neighbor with label $2$. A set ${f_1,f_2,ldots,f_d}$ ofRoman dominating functions on $D$ with the property that $sum_{i=1}^d f_i(v)le 2$ for each $vin V(D)$,is called a {em Roman dominating family} (of functions) on $D$....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1999

ISSN: 0012-365X

DOI: 10.1016/s0012-365x(99)90123-1